On the Average Number of Sharp Crossings of Certain Gaussian Random Polynomials

On the average number of sharp crossings of certain Gaussian random polynomials

Expected Number of Slope Crossings of Certain Gaussian Random Polynomials

Let Qn(x) = ∑n i=0 Aix i be a random polynomial where the coefficients A0, A1, · · · form a sequence of centered Gaussian random variables. Moreover, assume that the increments ∆j = Aj − Aj−1, j = 0, 1, 2, · · · are independent, assuming A−1 = 0. The coefficients can be considered as n consecutive observations of a Brownian motion. We study the number of times that such a random polynomial cros...

On Classifications of Random Polynomials

 Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...

Complete convergence of moving-average processes under negative dependence sub-Gaussian assumptions

The complete convergence is investigated for moving-average processes of doubly infinite sequence of negative dependence sub-gaussian random variables with zero means, finite variances and absolutely summable coefficients. As a corollary, the rate of complete convergence is obtained under some suitable conditions on the coefficients.

ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS

Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...